Searching Paths of Constant Bandwidth
نویسندگان
چکیده
As a generalization of paths, the notion of paths of bandwidth w is introduced. We show that, for constant w ≥ 1, the corresponding search problem for such a path of length k in a given graph is NP-complete and fixed-parameter tractable (FPT) in the parameter k, like this is known for the special case w = 1, the LONGEST PATH problem. We state the FPT algorithm in terms of a guess and check protocol which uses witnesses of size polynomial in the parameter.
منابع مشابه
شیوه های توزیع بار در مهندسی ترافیک
Because of rapidly rising network traffic, ISP providers are trying to create new network structures and extend more resources to control the growth of demands. It is important to efficiently split the network bandwidth among different sources so that each user has enough bandwidth. Traffic engineering is used to achieve this goal. Performing reliable and efficient network ope...
متن کاملGraph searching , elimination trees , and
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a generalization of bandwidth to partially ordered layouts. We consider this generalization from two main viewpoints: graph searching and tree decompositions. The three graph parameters pathwidth, profile and bandwidth related to linear layouts can be defined by variants of g...
متن کاملA tree-growth based ant colony algorithm for QoS multicast routing problem
QoS multicast routing is a non-linear combinatorial optimization problem. It tries to find a multicast routing tree with minimal cost that can satisfy constraints such as bandwidth, delay, and delay jitter. This problem is NP-complete. The solution to such problems is often to search first for paths from the source node to each destination node and then integrate these paths into a multicast tr...
متن کاملUltra-Widband Distributed Amplifier Using Loss Compensation Technique on Both Input and Output Circuit
In this paper, we analyze a distributed amplifier based on input/output attenuation compensation. The analysis is carried out for a HEMT transistor; and a constant-k section filter is used to calculate the amplifier’s characteristics such as attenuation factor, phase constant and gain. The proposed design approach enables us to examine the tradeoff among the variables, which include the type an...
متن کاملHierarchical Ring Topologies and the Effect of Their Bisection Bandwidth Constraints
Ring-based hierarchical networks are interesting alternatives to popular direct networks such as 2D meshes or tori. They allow for simple router designs, wider communications paths, and faster networks than their direct network counterparts. However, they have a constant bisection bandwidth, regardless of system size. In this paper, we present the results of a simulation study to determine how ...
متن کامل